The Exact and BD Algorithm for Data-Gathering Cluster-Based Wireless Sensor Network

Wireless sensor networks provide the facility for collecting diverse types of data at frequent intervals, even multiple times per second and over large areas. Data-gathering wireless sensor networks (WSNs) are operated unattended over long time horizons to collect data in several applications such as those in climate monitoring and a variety of ecological studies. The proposed system considers a LEACH model to optimally determine the sink and CH locations as well as the data flow in the network. This model effectively utilizes both the position and energy-level aspects of the sensors while selecting the CHs and avoid the highest-energy sensors that are well-positioned sensors with respect to sinks being selected as CHs repeatedly in successive periods. The current work focuses on the development of an effective Benders decomposition (BD) approach that incorporates an upper bound heuristic algorithm, strengthened cuts, and an optimal framework for accelerated convergence for LEACH model. Computational evidence demonstrates the efficiency of the BD approach and the heuristic in terms of solution quality and time. Keywords— Benders Decomposition, LEACH, Cluster Head, Wireless Sensor Network Raghavendra P R et al, International Journal of Computer Science and Mobile Computing, Vol.4 Issue.4, April2015, pg. 172-178 © 2015, IJCSMC All Rights Reserved 173